6.856 — Randomized Algorithms
نویسنده
چکیده
1. Suppose you are given a graph whose edge lengths are all integers in the range from 0 to B. Suppose also that you are given the all-pairs distance matrix for this graph (it can be constructed by a variant of Seidel’s distance algorithm). Prove that you can identify the (successor matrix representation of the) shortest paths in O(BMM(n) log n) time, where MM(n) is the time to multiply n × n matrices.
منابع مشابه
Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملIntroduction to Randomized Algorithms
There are two principal advantages to randomized algorithms. The first advantage is performance; randomized algorithms run faster than the best-known deterministic algorithms for many problems. The second advantage is that many randomized algorithms are simpler to describe and implement than deterministic algorithms of comparable performance. There are general principles that lie at the heart o...
متن کاملRandomized Algorithms A short course on randomized algorithms and the probabilistic method
1 Randomized Algorithms and the Probabilistic Method 2 1.
متن کاملRandomized Algorithms
We have already seen some uses of randomization in the design of on line algorithms In these notes we shall describe other important illustrations of randomized algo rithms in other areas of the theory of algorithms For those interested in learning more about randomized algorithms we strongly recommend the forthcoming book by Motwani and Raghavan First we shall describe some basic principles wh...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000